UNSUPERVISED GROUPING OF MOVING OBJECTS BASED ON AGGLOMERATIVE HIERARCHICAL CLUSTERING
نویسندگان
چکیده
منابع مشابه
Unsupervised Grouping of Moving Objects Based on Agglomerative Hierarchical Clustering
In this article, we present a method to identify a grouping of sensor nodes that show similar movement patterns in an ad-hoc manner. The motivation behind the ad-hoc grouping is to allow a system to monitor complex and concrete situations of people and/or devices such as “who is/are utilizing what object(s)” and “what objects are carried together” without any supervision of human before and at ...
متن کاملClustering Moving Objects Based On A Moving Clustering Feature Tree
Clustering moving objects is a challenging task, especially when space consumption must be flexibly and efficiently adjusted for adapting to dynamic object movements. In this paper we develop an efficient approach for managing moving objects and predicting the essential time when moving clusters may need to be updated. Under our approach, moving objects are first inserted into a moving clusteri...
متن کاملModern hierarchical, agglomerative clustering algorithms
This paper presents algorithms for hierarchical, agglomerative clustering which perform most efficiently in the general-purpose setup that is given in modern standard software. Requirements are: (1) the input data is given by pairwise dissimilarities between data points, but extensions to vector data are also discussed (2) the output is a “stepwise dendrogram”, a data structure which is shared ...
متن کاملDivisive Hierarchical Clustering with K-means and Agglomerative Hierarchical Clustering
To implement divisive hierarchical clustering algorithm with K-means and to apply Agglomerative Hierarchical Clustering on the resultant data in data mining where efficient and accurate result. In Hierarchical Clustering by finding the initial k centroids in a fixed manner instead of randomly choosing them. In which k centroids are chosen by dividing the one dimensional data of a particular clu...
متن کامل2 Review of Agglomerative Hierarchical Clustering Algorithms
Hierarchical methods are well known clustering technique that can be potentially very useful for various data mining tasks. A hierarchical clustering scheme produces a sequence of clusterings in which each clustering is nested into the next clustering in the sequence. Since hierarchical clustering is a greedy search algorithm based on a local search, the merging decision made early in the agglo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Smart Sensing and Intelligent Systems
سال: 2016
ISSN: 1178-5608
DOI: 10.21307/ijssis-2017-964